An algorithm for linearly constrained convex nondifferentiable minimization problems
نویسندگان
چکیده
منابع مشابه
An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions
A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.
متن کاملA Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
A decomposition algorithm based on proximal bundle-type method with inexact data is presented for minimizing an unconstrained nonsmooth convex function f . At each iteration, only the approximate evaluation of f and its approximate subgradients are required which make the algorithm easier to implement. It is shown that every cluster of the sequence of iterates generated by the proposed algorith...
متن کاملCustomized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
This paper takes a uniform look at the customized applications of proximal point algorithm (PPA) to two classes of problems: the linearly constrained convex minimization problem with a generic or separable objective function and a saddle-point problem. We model these two classes of problems uniformly by a mixed variational inequality, and show how PPA with customized proximal parameters can yie...
متن کاملA Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization
This paper presents a new dual formulation for quadratically constrained convex programs (QCCP). The special structure of the derived dual problem allows to apply the gradient projection algorithm to produce a simple explicit method involving only elementary vector-matrix operations, that is proven to converge at a linear rate.
متن کاملAn Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
Many scientific and engineering applications feature large-scale non-smooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the non-smooth objective is equipped with a tractable proximity operator and that the convex constraints afford a self-concordant barrier. We provide a new joint treatment of proximal a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1985
ISSN: 0022-247X
DOI: 10.1016/0022-247x(85)90061-7